Entropy-Based Approach in Selection Exact String-Matching Algorithms

Fast exact string matching algorithms

String matching is the problem of finding all the occurrences of a pattern in a text. We propose a very fast new family of string matching algorithms based on hashing q-grams. The new algorithms are the fastest on many cases, in particular, on small size alphabets. © 2007 Elsevier B.V. All rights reserved.

Technology Beats Algorithms (in Exact String Matching)

More than 120 algorithms have been developed for exact string matching within the last 40 years. We show by experiments that the näıve algorithm exploiting SIMD instructions of modern CPUs (with symbols compared in a special order) is the fastest one for patterns of length up to about 50 symbols and extremely good for longer patterns and small alphabets. The algorithm compares 16 or 32 characte...

Handbook of Exact String Matching Algorithms

Give us 5 minutes and we will show you the best book to read today. This is it, the handbook of exact string matching algorithms that will be your best choice for better reading book. Your five times will not spend wasted by reading this website. You can take the book as a source to make better concept. Referring the books that can be situated with your needs is sometime difficult. But here, th...

Fast Algorithms for Exact String Matching

Given a pattern string P of length n and a query string T of length m, where the characters of P and T are drawn from an alphabet of size ∆, the exact string matching problem consists of finding all occurrences of P in T . For this problem, we present algorithms that in O(n∆) time preprocess P to essentially identify sparse(P ), a rarely occurring substring of P , and then use it to find occurr...

Sequential Exact String Matching